Permutations preserving divisibility
نویسندگان
چکیده
We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF (2)) by a polynomial ( ).
منابع مشابه
A Study of Eulerian Numbers for Permutations in the Alternating Group
The cardinalities of the sets of even and odd permutations with a given ascent number are investigated by an operator that was introduced by the author. We will deduce the recurrence relations for such Eulerian numbers of even and odd permutations, and deduce divisibility properties by prime powers concerning them and some related numbers.
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملThe complexity of divisibility
We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an NP-complete problem, and extend this result to nonnegative matrices, and completely-positive tra...
متن کاملOn edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive trees and permutations, which relates the arising edge-weights in recursive trees with inversions of the corresponding permutations. Using this bijection we obtain exact and limiting distribution results for the number ...
متن کاملGenerating Sym(ω) by Permutations Preserving Dense Orders
We show how generic permutations of ω can be presented by products of permutations preserving dense orders.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001